Polynomial kernels for tracking shortest paths
نویسندگان
چکیده
Given an undirected graph G=(V,E), vertices s,t∈V, and integer k, Tracking Shortest Paths requires deciding whether there exists a set of k T⊆V such that for any two distinct shortest paths between s t, say P1 P2, we have T∩V(P1)≠T∩V(P2). In this paper, give the first polynomial size kernel problem. Specifically show existence with O(k2) edges in general graphs O(k) planar DAG This problem admits parameter transformation to Paths, implies O(k4) graphs. Based on above also single exponential algorithm
منابع مشابه
Polynomial auction algorithms for shortest paths
In this paper we consider strongly polynomial variations of the auction algorithm for the single origin/many destinations shortest path problem. These variations are based on the idea of graph reduction, that is, deleting unnecessary arcs of the graph by using certain bounds naturally obtained in the course of the algorithm. We study the structure of the reduced graph and we exploit this struct...
متن کاملShortest Two Disjoint Paths in Polynomial Time
Given an undirected graph and two pairs of vertices (si, ti) for i ∈ {1, 2} we show that there is a polynomial time Monte Carlo algorithm that finds disjoint paths of smallest total length joining si and ti for i ∈ {1, 2} respectively, or concludes that there most likely are no such paths at all. Our algorithm applies to both the vertexand edge-disjoint versions of the problem. Our algorithm is...
متن کاملShortest paths between shortest paths
We study the following problem on recon guring shortest paths in graphs: Given two shortest st paths, what is the minimum number of steps required to transform one into the other, where each intermediate path must also be a shortest s-t path and must di er from the previous one by only one vertex. We prove that the shortest recon guration sequence can be exponential in the size of the graph and...
متن کاملA Generalized Successive Shortest Paths Solver for Tracking Dividing Targets
Tracking-by-detection methods are prevailing in many tracking scenarios. One attractive property is that in the absence of additional constraints they can be solved optimally in polynomial time, e.g. by min-cost flow solvers. But when potentially dividing targets need to be tracked – as is the case for biological tasks like cell tracking – finding the solution to a global tracking-by-detection ...
متن کاملThe Polynomial Method and All-Pairs Shortest Paths
We examine a recent development in circuit complexity used to speed up algorithms with circuit representations, and how it can be applied to the All-Pairs Shortest Path problem specifically. Additionally, we look at a few other problems on which improvements can be made in this manner. We also examine other consequences of possible extensions of this work.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information Processing Letters
سال: 2023
ISSN: ['1872-6119', '0020-0190']
DOI: https://doi.org/10.1016/j.ipl.2022.106315